Interception of a Moving Object in a FIFO Graph

This paper solves the problem of intercepting a moving object in FIFO graphs. In the graph, a first mobile (the target) is moving with a known fixed itinerary. The second mobile (the pursuer) aims to reach the first one with the minimum delay. So, our goal is to find the shortest path for the interception taking into account the dynamic nature of the graph. This interception problem can be applied to the case of an urban transport company that needs to send a rescue team to one of their buses that is still in movement. First, we propose a model to set the basic problem. Then we present an interception algorithm based on Dijkstra algorithm for shortest path computation in a graph. After, we prove that the result of the algorithm is optimal. Finally, we compute the complexity of the algorithm and we prove its efficiency.